Modelling species presence‐only data with random forests

نویسندگان

چکیده

The random forest (RF) algorithm is an ensemble of classification or regression trees and widely used, including for species distribution modelling (SDM). Many researchers use implementations RF in the R programming language with default parameters to analyse presence-only data together ‘background' samples. However, there good evidence that does not perform well such ‘presence-background' modelling. This often attributed disparity between number presence background samples, also known as 'class imbalance', several solutions have been proposed. Here, we first set context: sample should be large enough represent all environments region. We then aim understand drivers poor performance when models are fitted alongside show overlap' (where both classes occur same environment) important driver performance, class imbalance. Class overlap can even degrade presence–absence data. explain, test evaluate suggested solutions. Using simulated real presence-background data, compare other weighting sampling approaches. Our results demonstrate clear improvement RFs techniques explicitly manage imbalance used. these either limit enforce tree depth. Without compromising environmental representativeness sampled background, identify approaches fitting ameliorate effects allow excellent predictive performance. Understanding problems allows new insights into how best fit models, guide future efforts deal

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Random Forests for Big Data

Big Data is one of the major challenges of statistical science and has numerous consequences from algorithmic and theoretical viewpoints. Big Data always involve massive data but they also often include data streams and data heterogeneity. Recently some statistical methods have been adapted to process Big Data, like linear regression models, clustering methods and bootstrapping schemes. Based o...

متن کامل

Random survival forests for high-dimensional data

Minimal depth is a dimensionless order statistic that measures the predictiveness of a variable in a survival tree. It can be used to select variables in high-dimensional problems using Random Survival Forests (RSF), a new extension of Breiman’s Random Forests (RF) to survival settings. We review this methodology and demonstrate its use in high-dimensional survival problems using a public domai...

متن کامل

Functional Data Classification with Kernel-Induced Random Forests

Scientists and others today often collect samples of curves and other functional data. The multivariate data classification methods cannot be directly used for functional data classification because the curse of dimensionality and difficulty in taking in account the correlation and order of functional data. We extend the kernel-induced random forest method for discriminating functional data by ...

متن کامل

Exploratory Data Analysis using Random Forests

Although the rise of "big data" has made machine learning algorithms more visible and relevant for social scientists, they are still widely considered to be "black box" models that are not well suited for substantive research: only prediction. We argue that this need not be the case, and present one method, Random Forests, with an emphasis on its practical application for exploratory analysis a...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Ecography

سال: 2021

ISSN: ['0906-7590', '1600-0587']

DOI: https://doi.org/10.1111/ecog.05615